The isomorphism problem for uniserial modules over an arbitrary ring

ω1-generated uniserial modules over chain rings

The purpose of this paper is to provide a criterion of an occurrence of uncountably generated uniserial modules over chain rings. As we show it suffices to investigate two extreme cases, nearly simple chain rings, i.e. chain rings containing only three twosided ideals, and chain rings with “many” two-sided ideals. We prove that there exists an ω1-generated uniserial module over every non-artini...

Some model theory over an exceptional uniserial ring and decompositions of serial modules

We give an example of a direct summand of a serial module that does not admit an indecomposable decomposition.

Divisible Uniserial Modules over Valuation Domains

Uniformly Secondary Modules over Commutative Ring

In [2] the notion of “uniformly ideal” was introduced and developed the basic theory. In this article we introduce and advance a theory which, in a sense, dual to that i.e, the notion of “uniformly secondary module”.

the algorithm for solving the inverse numerical range problem

برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.